Author assistance visualizations for Ice-Bound, a combinatorial narrative
نویسندگان
چکیده
As games increase in narrative complexity, challenges mount for their story designers. As authors, these designers are concerned with building an experience that responds to players in consistent and engaging ways, even when players make unpredictable story choices amongst a large group of options. Furthermore, they want those choices to have narrative impact. However, historically the task of authoring such narratives can prove daunting or infeasible. One approach to solving this problem is to use external tools to visualize story structure. This paper introduces a new set of design-time visualizations for combinatorial interactive narrative authoring. By using these visualizations during the creation of Ice-Bound (an interactive narrative iPad game) we were able to author content within a large combinatorial possibility space, and achieve both desired player freedom and content responsiveness. This generalized visualization strategy could also prove useful to future interactive narratives using combinatorial approaches.
منابع مشابه
Ice-Bound: Combining richly-realized story with expressive gameplay
This paper describes the design and implementation of IceBound, an indie game that uses dynamic story techniques. Storygames with high narrative process intensity (where story is generated or recombined in algorithmically interesting ways, rather than being simply pre-authored) are still rare, in part because story creators are hesitant to cede control over output quality to a system. As a resu...
متن کاملIce-Bound: A novel of reconfiguration
Ice-bound is a new story game combining an iPad and a printed book, using procedural story techniques and augmented reality to create a multilayered, professional-quality interactive narrative.
متن کاملعدد تناوبی گرافها
In 2015, Alishahi and Hajiabolhassan introduced the altermatic number of graphs as a lower bound for the chromatic number of them. Their proof is based on the Tucker lemma, a combinatorial counterpart of the Borsuk-Ulam theorem, which is a well-known result in topological combinatorics. In this paper, we present a combinatorial proof for the Alishahi-Hajiabolhassan theorem.
متن کاملData Visualizations For Complex Computational Narratives
Computational storytelling, in both games and the larger field of interactive media, offers a wide range of new narratological forms that are otherwise impractical–or impossible–to create. A variety of systems push at these possibilities, but largely the potential narratological complexity outpaces our human ability to effectively author for them. Because of this, authors are limited not so muc...
متن کاملTowards a Computational Model of Narrative Visualization
The task of narrative visualization has been the subject of increasing interest in recent years. Much like data visualization, narrative visualization offers users an informative and aesthetically pleasing perspective on “story data.” Automatically creating visual representations of narratives poses significant computational challenges due to the complex affective and causal elements, among oth...
متن کامل